Une généralisation des nombres de Milnor pour les intersections complètes à singularités non isolées

Une généralisation automorphe des nombres de Stirling

Let [n] be theset {1,2, *.. , n> and CT a given permutation in S,, the symmetric group on [n]. The (unsigned) Stirling numbers of the first kind enumerate the permutations on En] with k cycles and those of the second kind give the number partitions of [n] having k blocks. In this paper we compute the number of permutations on [n] with k cycles and the number of partitions on [n] having k blocks...

Une démarche dirigée par les modèles pour construire les machines de déploiement des intergiciels à composants

Une assistance pour l'évolution des logiciels à base de composants

Among all the stages which constitute the maintenance process, the comprehension of an application before its evolution, and regression testing after its evolution are by far the most expensive. We present an approach which helps to reduce the costs associated with these two stages for component-based software. It proposes to formally document at each stage of the software life cycle the links ...

Pour une généralisation des systèmes C.A.O : approche et applications

GWUM : une généralisation des pages Web guidée par les usages

The usage analysis of a Web site based on the extracted sequential patterns is often limited by the low support of these patterns. That is mainly due to the great diversity of the pages and behaviors. However, it is possible to group the majority of these pages in various categories during a preprocessing. Then, using these categories, rather than the URL, will allow us to discover "generic" be...